Date: Tue, 10 Dec 1996 15:20:41 GMT
Server: NCSA/1.4.2
Content-type: text/html
Last-modified: Sun, 20 Oct 1996 19:41:15 GMT
Content-length: 956

<html>
<head>
<title>
Paul Beame: papers
</title>
</head>

<body>

<h1>Paul Beame: Selected Recent Papers
</h1>

<li> <a href="clause.ps"> Simplified and Improved Resolution Lower Bounds</a>
     FOCS 96 </li>
<li> <a href="conn.ps"> Improved Depth Lower Bounds for Small Distance Connectivity</a> FOCS 95 </li>
<li> <a href="search.ps"> The Relative Complexity of NP Search Problems </a> STOC 95</li>
<li> <a href="stell.ps"> Lower Bounds for Hilbert's Nullstellensatz and propositional proofs</a> FOCS 94</li>
<li> <a href="primer.ps"> A Switching Lemma Primer </a></li>
<li> <a href="match.ps"> An Exponential Separation between the Matching
Principle and the Pigeonhole Principle </a></li>
<li> <a href="crew.ps"> Separating the Power of EREW and CREW PRAMs with Small Communication Width </a></li>
<li> <a href="bag.ps"> Time-Space Tradeoffs for Undirected Graph Traversal </a></li>

</body>
<address>
<hr>
beame@cs.washington.edu
</address>

</html>
